[20250613] BOJ / G3 / 파티 / 설진영 #351
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/1238
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
N개 마을 학생들이 X번 마을 파티 후 집으로 돌아가는 문제. 단방향 도로에서 왕복 시간이 가장 긴 학생의 시간을 구해야 함.
🔍 풀이 방법
다익스트라 2번 + 역방향 그래프
⏳ 회고
단방향 그래프 특성상 갈 때/올 때 경로가 다름을 인식하는 것이 핵심인 것 같다.
다익스트라를 2번만 돌려서 해결하도록 했다.